A top-k query answering procedure for fuzzy logic programming
نویسندگان
چکیده
We present a top-k query answering procedure for Fuzzy Logic Programming, in which arbitrary computable functions may appear in the rule bodies to manipulate truth values. The top-k ranking problem, i.e. determining the top k answers to a query, becomes important as soon as the set of facts becomes quite large. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Uncertainty Management in Logic Programming: Simple and Effective Top-Down Query Answering
We present a simple, yet general top-down query answering procedure for logic programs managing uncertainty. The main features are: (i) the certainty values are taken from a certainty lattice; (ii) computable functions may appear in the rule bodies to manipulate certainties; and (iii) we solve the problem by a reduction to an equational systems, for which we device a top-down procedure.
متن کاملTowards Top-k Query Answering in Description Logics: The Case of DL-Lite
We address the problem of evaluating ranked top-k queries in description logics. The problem occurs whenever we allow queries such as “find cheap hotels close to the conference location” in which fuzzy predicates like cheap and close occur. We show how to efficiently compute the top-k answers of conjunctive queries with fuzzy predicates over DL-LITE like knowledge bases.
متن کاملQuery Answering in Normal Logic Programs Under Uncertainty
We present a simple, yet general top-down query answering procedure for normal logic programs over lattices and bilattices, where functions may appear in the rule bodies. Its interest relies on the fact that many approaches to paraconsistency and uncertainty in logic programs with or without non-monotonic negation are based on bilattices or lattices, respectively.
متن کاملAnswering Vague Queries in Fuzzy DL-Lite
Fuzzy Description Logics (fuzzy DLs) allow to describe structured knowledge with vague concepts. Unlike classical DLs, in fuzzy DLs an answer is a set of tuples ranked according to the degree they satisfy the query. In this paper, we consider fuzzy DL-Lite. We show how to compute efficiently the top-k answers of a complex query (i.e. conjunctive queries) over a huge set of instances.
متن کاملQuery Answering under the Any-World Assumption for Normal Logic Programs
Recently, in (Loyer & Straccia 2005) the Any-World Assumption (AWA) has been introduced for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA). The AWA allows any assignment (i.e. interpretation), over a truth space (bilattice), to be a default assumption and, thus, the CWA and OWA are just special cases. Whil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fuzzy Sets and Systems
دوره 205 شماره
صفحات -
تاریخ انتشار 2012